Asymptotics of the number partitioning distribution
نویسندگان
چکیده
منابع مشابه
Asymptotics of the Number Partitioning Distribution
The number partitioning problem can be interpreted physically in terms of a thermally isolated non-interacting Bose gas trapped in a one-dimensional harmonic oscillator potential. We exploit this analogy to characterize, by means of a detour to the Bose gas within the canonical ensemble, the probability distribution for finding a specified number of summands in a randomly chosen partition of an...
متن کاملAsymptotics for the Probability of Connectedness and the Distribution of Number of Components
Let n be the fraction of structures of \size" n which are \connected"; e.g., (a) the fraction of labeled or unlabeled n-vertex graphs having one component, (b) the fraction of partitions of n or of an n-set having a single part or block, or (c) the fraction of n-vertex forests that contain only one tree. Various authors have considered lim n, provided it exists. It is convenient to distinguish ...
متن کاملMulti-Way Number Partitioning
The number partitioning problem is to divide a given set of integers into a collection of subsets, so that the sum of the numbers in each subset are as nearly equal as possible. While a very efficient algorithm exists for optimal two-way partitioning, it is not nearly as effective for multi-way partitioning. We develop two new linear-space algorithms for multi-way partitioning, and demonstrate ...
متن کاملProbabilistic Analysis of the Number Partitioning Problem
Given a sequence of N positive real numbers {a1, a2, . . . , aN}, the number partitioning problem consists of partitioning them into two sets such that the absolute value of the difference of the sums of aj over the two sets is minimized. In the case that the aj ’s are statistically independent random variables uniformly distributed in the unit interval, this NP-complete problem is equivalent t...
متن کاملASYMPTOTICS OF THE NUMBER OF k-WORDS WITH AN `-DESCENT
The number of words w = w1 · · ·wn, 1 ≤ wi ≤ k, for which there are 1 ≤ i1 < · · · < i` ≤ n and wi1 > · · · > wi` , is given, by the Schensted-Knuth correspondence, in terms of standard and semi-standard Young tableaux. When n → ∞, the asymptotics of the number of such words is calculated. Work partially supported by N.S.F. Grant No. DMS-94-01197.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Europhysics Letters (EPL)
سال: 2002
ISSN: 0295-5075,1286-4854
DOI: 10.1209/epl/i2002-00133-6